#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
bool vis[maxn];
LL wh[maxn],bl[maxn];
///1 2 2 3 1 2 2 2
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++){
    cin>>a[i];
  }
  LL tot1=0;LL tot2=0;
  for(LL i=1;i<=n;i++){
    if(a[i]!=a[i-1]){
        vis[i]=true;
        wh[++tot1]=a[i];
    }
  }
  LL last=0;
  for(LL i=1;i<=n;i++){
    if(!vis[i]){
        if(last!=a[i]){
            bl[++tot2]=a[i];
            last=a[i];
        }
    }
  }
  cout<<tot1+tot2<<endl;
return 0;
}
